- easy to solve
- легкий для розкриття (про злочин тощо)
English-Ukrainian law dictionary.
easy to solve
Look at other dictionaries:
The Big Easy (film) — Infobox Film name = The Big Easy image size = 200px caption = theatrical poster director = Jim McBride producer = Executive Producer: Mort Engelberg Producer: Stephen J. Friedman writer = Daniel Petrie Jr. starring = Dennis Quaid Ellen Barkin… … Wikipedia
Murder Is Easy — Dust jacket … Wikipedia
The Big Over Easy — Infobox Book | name = The Big Over Easy title orig = translator = image caption = The American cover of The Big Over Easy author = Jasper Fforde illustrator = cover artist = country = UK language = English series = Nursery Crimes subject = genre … Wikipedia
Reduction (complexity) — Example of a reduction from a boolean satisfiability problem to a vertex cover problem. Blue vertices form a vertex cover which corresponds to truth values. In computability theory and computational complexity theory, a reduction is a… … Wikipedia
cryptology — cryptologist, n. cryptologic /krip tl oj ik/, cryptological, adj. /krip tol euh jee/, n. 1. cryptography. 2. the science and study of cryptanalysis and cryptography. [1635 45; < NL cryptologia. See CRYPTO , LOGY] * * * Introduction … Universalium
Quartic equation — In mathematics, a quartic equation is one which can be expressed as a quartic function equalling zero. The general form of a quartic equation is:ax^4+bx^3+cx^2+dx+e=0 ,where a ne; 0.The quartic is the highest order polynomial equation that can be … Wikipedia
Computability theory (computer science) — In computer science, computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation.Computability theory differs from the related discipline of… … Wikipedia
Virtual synchrony — is an interprocess messaging passing (sometimes called event queue management) technology. Virtual synchrony systems allow programs running in a network to organize themselves into process groups , and to send messages to groups (as opposed to… … Wikipedia
Optimal control — theory, an extension of the calculus of variations, is a mathematical optimization method for deriving control policies. The method is largely due to the work of Lev Pontryagin and his collaborators in the Soviet Union[1] and Richard Bellman in… … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
Lattice problem — In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to construction of secure lattice based cryptosystems. For applications in such cryptosystems,… … Wikipedia
